On the betweenness centrality of trees, forests and cycles
نویسندگان
چکیده
منابع مشابه
Betweenness centrality profiles in trees
Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in a network. The kbetweenness centrality of a vertex is defined similarly, but only considers shortest paths of length at most k. The sequence of k-betweenness centralities for all possible values of k forms the betwee...
متن کاملOn the distribution of betweenness centrality in random trees
Betweenness centrality is a quantity that is frequently used to measure how ‘central’ a vertex v is. It is defined as the sum, over pairs of vertices other than v, of the proportions of shortest paths that pass through v. In this paper, we study the distribution of the betweenness centrality in random trees and related, subcritical graph families. Specifically, we prove that the betweenness cen...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملFully Dynamic Betweenness Centrality
We present fully dynamic algorithms for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν∗ · log n) time per update with our basic algorithm, and O(ν∗ · log n) time with a more complex algorithm, where n = |V |, and ν∗ bounds the number...
متن کاملBetweenness Centrality - Incremental and Faster
We present an incremental algorithm that updates the betweenness centrality (BC) score of all vertices in a graph G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O(ν∗ · n) time, where ν∗ is bounded by m∗, the number of edges that lie on a shortest path in G. We achieve the same bound for the more general incremental vertex update ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainable Forestry
سال: 2018
ISSN: 2578-2002
DOI: 10.24294/sf.v1i2.968